Combining Formal Reasoning Techniques with CSP
نویسندگان
چکیده
منابع مشابه
Survey of Applications Integrating Constraint Satisfaction and Case-Based Reasoning
In recent years, there has been a growing focus on research and applications that integrate several reasoning techniques. The general motivation for integrating several reasoning modes is to achieve a synergy which produces results that could not be obtained if each mode were operating individually. One such integration that has begun to see its application in many different problem domains is ...
متن کاملDynamic Constraint Satisfaction using Case-Based Reasoning Techniques
The Dynamic Constraint Satisfaction Problem (DCSP) formalism has been gaining attention as a valuable and often necessary extension of the static CSP framework. Dynamic Constraint Satisfaction enables CSP techniques to be applied more extensively, since it can be applied in domains where the set of constraints and variables involved in the problem evolves with time. At the same time, the Case-B...
متن کاملCompiling CSP
CSP, Hoare’s Communicating Sequential Processes, is a formal language for specifying, implementing and reasoning about concurrent processes and their interactions. Existing software tools that deal with CSP directly are largely concerned with assisting formal proofs. This paper presents an alternative use for CSP, namely the compilation of CSP systems to executable code. The main motivation for...
متن کاملCombining Specification Techniques for Processes, Data and Time
We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration Calculus [40]. The emphasis is on a smooth integration of the underlying semantic models and its use for verifying properties of CSP-OZ-DC specifications by a combined application of the model-checkers FDR [29] for CSP and UPP...
متن کاملHierarchical Reasoning in Probabilistic CSP
Probabilistic CSP extends the language of CSP with an operator for probabilistic choice. However reasoning about an intricate combination of nondeterminism, communication and probabilistic behaviour can be complicated. In standard CSP, and in formal methods generally, such complication is overcome (when possible) by use of hierarchical reasoning. In this paper we provide a foundation for liftin...
متن کامل